Monotonic Tree

نویسندگان

  • Yuqing Song
  • Aidong Zhang
چکیده

Contour trees have been used in geographic information systems (GIS) and medical imaging to display scalar data. Contours are only defined for continuous functions. For an image represented by discrete data, a continuous function is first defined as an interpolation of the data. Then the contour tree is defined on this continuous function. In this paper, we introduce a new concept termed monotonic line, which is directly defined on discrete data. All monotonic lines in an image form a tree, called monotonic tree. As compared with contour trees, monotonic trees avoid the step of interpolation, thus can be computed more efficiently. Monotonic tree can also be used as a hierarchical representation of image structures in computer imagery.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonic Tree of Images and Its Application in Image Processing

Contour trees have been used in geographic information systems (GIS) and medical imaging to display scalar data. Contours are only defined for continuous functions. For an image represented by discrete data, a continuous function is first defined as an interpolation of the data. Then the contour tree is defined on this continuous function. In this paper, we introduce a new concept termed monoto...

متن کامل

Obligation rules for minimum cost spanning tree situations and their monotonicity properties

We introduce the class of Obligation rules for minimum cost spanning tree situations. The main result of this paper is that such rules are cost monotonic and induce also population monotonic allocation schemes. Another characteristic of Obligation rules is that they assign to a minimum cost spanning tree situation a vector of cost contributions which can be obtained as product of a double stoch...

متن کامل

Error correcting code using tree-like multilayer perceptron

s 0 is encoded into a codeword y0 using a tree-like committee machine (committee tree) or a tree-like parity machine (parity tree). Based on these architectures, several schemes featuring monotonic or non-monotonic units are introduced. The codeword y0 is then transmitted via a Binary Asymmetric Channel (BAC) where it is corrupted by noise. The analytical performance of these schemes is investi...

متن کامل

Locating Image Background By Monotonic Tree

In this paper, we discuss an approach to locating image background, which is based on monotonic tree, a derivation of contour tree for discrete data. We first make two assumptions about image background. As compared with the foreground shapes, the background regions are (1) smoother in intensity; and (2) peripheral in location. In an input image, the harshness of the foreground is characterized...

متن کامل

Energy analysis of RFID Arbitration protocols

This report deals with the time and energy analysis for RFID arbitration protocols. The goal is to analyse and compare various RFID arbitration algorithms. Two protocols are detailed in here – The tree search algorithm of Capetanakis and a non-monotonic windowing protocol. A new simpler proof is given for the expected time complexity of the tree splitting protocol and the worst case energy cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002